Discrete Polynomial Curve Fitting to Noisy Data
نویسندگان
چکیده
A discrete polynomial curve is defined as a set of points lying between two polynomial curves. This paper deals with the problem of fitting a discrete polynomial curve to given integer points in the presence of outliers. We formulate the problem as a discrete optimization problem in which the number of points included in the discrete polynomial curve, i.e., the number of inliers, is maximized. We then propose a method that effectively achieves a solution guaranteeing local maximality by using a local search, called rock climging, with a seed obtained by RANSAC. Experimental results demonstrate the effectiveness of our proposed method.
منابع مشابه
Discrete Polynomial Curve Fitting Guaranteeing Inclusion-Wise Maximality of Inlier Set
This paper deals with the problem of fitting a discrete polynomial curve to 2D noisy data. We use a discrete polynomial curve model achieving connectivity in the discrete space. We formulate the fitting as the problem to find parameters of this model maximizing the number of inliers i.e., data points contained in the discrete polynomial curve. We propose a method guaranteeing inclusion-wise max...
متن کاملSignal-to-noise Ratio for Mtci and Ndvi Time Series Data
The Phenology of vegetation varies with climate and variability in phenology is a powerful measure of climate change. Remotely-sensed data can be used to produce phenology curves that capture ‘green-up’, maturity and senescence from local to global scales. These curves are usually produced with Normalised Difference Vegetation Index (NDVI) data but are notoriously noisy. The MERIS Terrestrial C...
متن کاملThree Dimensional Boundary Detection Using Higher-Order Surface Fitting and Directional Smoothing
The authors propose an algorithm for detection of three-dimensional bundaries in noisy images based on higher-order polynomial surface fitting and directional smoothing. Fitting a polynomial to the local intensities gives the intensity hypersurface. An isointensity surface i s derived from the hyperplane and directional smwthiag is defined as smoothing along this isointensjty surface. The devel...
متن کاملEfficiently Updating Feasible Regions for Fitting Discrete Polynomial Curve
We deal with the problem of fitting a discrete polynomial curve to 2D data in the presence of outliers. Finding a maximal inlier set from given data that describes a discrete polynomial curve is equivalent with finding the feasible region corresponding to the set in the parameter space. When iteratively adding a data point to the current inlier set, how to update its feasible region is a crucia...
متن کاملModeling by Fitting a Union of Polynomial Functions to Data in an Errors-in-Variables Context
We present a model construction method based on a local fitting of polynomial functions to noisy data and building the entire model as a union of regions explained by such polynomial functions. Local fitting is shown to reduce to solving a polynomial eigenvalue problem where the matrix coefficients are data covariance and approximated noise covariance matrices that capture distortion effects by...
متن کامل